Gaussian Particle Swarm Optimization with Differential Evolution Mutation
نویسندگان
چکیده
During the past decade, the particle swarm optimization (PSO) with various versions showed competitiveness on the constrained optimization problems. In this paper, an improved Gaussian particle swarm optimization algorithm (GPSO) is proposed to improve the diversity and local search ability of the population. A mutation operator based on differential evolution (DE) is designed and employed to update the personal best position of the particle and the global best position of the population. The purpose is to improve the local search ability of GPSO and the probability to find the global optima. The regeneration strategy is employed to update the stagnated particle so as further to improve the diversity of GPSO. A simple feasibility-based method is employed to compare the performances of different particles. Simulation results of three constrained engineering optimization problems demonstrate the effectiveness of the proposed algorithm.
منابع مشابه
Solving the Economic Dispatch Problem using Novel Particle Swarm Optimization
This paper proposes an improved approach based on conventional particle swarm optimization (PSO) for solving an economic dispatch(ED) problem with considering the generator constraints. The mutation operators of the differential evolution (DE) are used for improving diversity exploration of PSO, which called particle swarm optimization with mutation operators (PSOM). The mutation operators are ...
متن کاملComparison of Dynamic Differential Evolution and Asynchronous Particle Swarm Optimization for Inverse Scattering of a Two- Dimensional Perfectly Conducting Cylinder
─ The application of optimization techniques for shape reconstruction of a perfectly conducting two-dimensional cylinder buried in a slab medium is reported in this paper, for which comparative study of four population-based optimization algorithms are conducted. The method of finite difference time domain (FDTD) is employed for the analysis of the forward scattering part, while the inverse sca...
متن کاملOptimization of Gaussian Process Models with Evolutionary Algorithms
Gaussian process (GP) models are non-parametric, blackbox models that represent a new method for system identification. The optimization of GP models, due to their probabilistic nature, is based on maximization of the probability of the model. This probability can be calculated by the marginal likelihood. Commonly used approaches for maximizing the marginal likelihood of GP models are the deter...
متن کاملEvolving cognitive and social experience in Particle Swarm Optimization through Differential Evolution: A hybrid approach
In recent years, the Particle Swarm Optimization has rapidly gained increasing popularity and many variants and hybrid approaches have been proposed to improve it. In this paper, motivated by the behavior and the spatial characteristics of the social and cognitive experience of eachparticle in the swarm,wedevelop ahybrid framework that combines theParticle Swarm Optimization and the Differentia...
متن کاملParticle Swarm Optimization Algorithm based on Differential Mutation and Thermodynamic Selection
In order to improve the convergence speed and the drawback of easily converging to the local optimum of the standard particle swarm optimization (PSO), two improved PSO algorithms are presented based on the simple particle swarm optimization algorithm without speed attribute. One is introducing differential mutation technology of differential evolution algorithm into the simple PSO algorithm fo...
متن کامل